|
Weighted round robin (WRR) is a network scheduling discipline. Each packet flow or connection has its own packet queue in a network interface controller. It is the simplest approximation of generalized processor sharing (GPS). While GPS serves infinitesimal amounts of data from each nonempty queue, WRR serves a number of packets for each nonempty queue: . == Algorithm == WRR mechanism (pseudo-code): // calculate number of packets to be served each round by connections for each flow f f.normalized_weight = f.weight / f.mean_packet_size min = findSmallestNormalizedWeight for each flow f f.packets_to_be_served = f.normalized_weight / min // main loop loop for each non-empty flow queue f min(f.packets_to_be_served, f.packets_waiting).times do servePacket f.getPacket 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Weighted round robin」の詳細全文を読む スポンサード リンク
|